0 On the structure of Markov flows L . Accardi
نویسندگان
چکیده
A new infinitesimal characterization of completely positive but not necessarily homomor-phic Markov flows from a C * –algebra to bounded operators on the boson Fock space over L 2 (R) is given. Contrarily to previous characterizations, based on stochastic differential equations, this characterization is universal, i.e. valid for arbitrary Markov flows. With this result the study of Markov flows is reduced to the study of four C 0 –semigroups. This includes the classical case and even in this case it seems to be new. The result is applied to deduce a new existence theorem for Markov flows.
منابع مشابه
N ov 1 99 9 On the structure of Markov flows
A new infinitesimal characterization of completely positive but not necessarily homomor-phic Markov flows from a C * –algebra to bounded operators on the boson Fock space over L 2 (R) is given. Contrarily to previous characterizations, based on stochastic differential equations, this characterization is universal, i.e. valid for arbitrary Markov flows. With this result the study of Markov flows...
متن کاملThe investigation of the affectivity of various types of cash flows in a diversified capital structure based on the type of strategy
The intensity of competition in business markets is to the extent that even the slightest strategic mistakes will lead to the failure of the organizations. The lack of knowledge and implementation of appropriate competitive strategies in such markets and, on the other hand, the failure to review the effects of these strategies on the types of cash flows in diverse capital structures is no also ...
متن کاملLearning Bayesian Network Structure using Markov Blanket in K2 Algorithm
A Bayesian network is a graphical model that represents a set of random variables and their causal relationship via a Directed Acyclic Graph (DAG). There are basically two methods used for learning Bayesian network: parameter-learning and structure-learning. One of the most effective structure-learning methods is K2 algorithm. Because the performance of the K2 algorithm depends on node...
متن کاملStatistical model of daily flow in arid and semi arid regions
Abstract Stochastic model for synthetic data generation is not available for daily flows of intermittent streams. Such a model is required in the planning and operation of structures on an intermittent stream for purposes where short time flow fluctuations are important. In this study a model is developed for such a case. The model consists of four steps: determination of the days on which fl...
متن کاملEntangled Markov Chains generated by Symmetric Channels
Abstract: A notion of entangled Markov chain was introduced by Accardi and Fidaleo in the context of quantum random walk. They proved that, in the finite dimensional case, the corresponding states have vanishing entropy density, but they did not prove that they are entangled. In the present note this entropy result is extended to the infinite dimensional case under the assumption of finite spee...
متن کامل